Variants of the time minimization assignment problem
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولThe Time Window Assignment Vehicle Routing Problem
In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window assignment vehicle routing problem, the TWAVRP. In this problem time windows have to be assigned before demand is known. Next the realization of dema...
متن کاملTotal time minimization of fuzzy transportation problem
This paper proposes a procedure for solving total time minimization in fuzzy transportation problem where the transportation time, source and destination parameters have been expressed as exponential fuzzy numbers by the decision maker. An algorithm is developed to obtain the optimal solution as exponential fuzzy number, which enables the decision maker to obtain more informing results and wide...
متن کاملA variant of time minimizing assignment problem
A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more than one job, he does them one after the other in any order. The aim of the present study is to f...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trabajos de Estadistica y de Investigacion Operativa
سال: 1984
ISSN: 0041-0241
DOI: 10.1007/bf02889707